On the Upward Planarity of Mixed Plane Graphs
نویسندگان
چکیده
منابع مشابه
On the Upward Planarity of Mixed Plane Graphs
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed plane graph G. In this paper, we study the computational complexity of testing whether a given mixed plane graph G is upward planar, i.e., whether...
متن کاملRolling Upward Planarity Testing of Strongly Connected Graphs
A graph is upward planar if it can be drawn without edge crossings such that all edges point upward. Upward planar graphs have been studied on the plane, the standing and rolling cylinders. For all these surfaces, the respective decision problem NP-hard in general. Efficient algorithms exist if the graph contains a single source and a single sink, but only for the plane and standing cylinder He...
متن کاملUpward Spirality and Upward Planarity Testing
The upward planarity testing problem is known to be NPhard. We describe an O(n)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.
متن کاملCombinatorial characterization of upward planarity
We give a purely combinatorial characterization of upward planar graphs in terms of upward planar orders, which also applies to characterize the planarity for nondirected graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2014
ISSN: 1526-1719
DOI: 10.7155/jgaa.00322